Mobility Support Using Bloom Filter in Content Oriented Networks

نویسندگان

  • Kenji Komatsu
  • Takuya Asaka
چکیده

Content oriented networks have been proposed as a new network architecture that does not rely on IP addresses, and these networks, content queries are routed based on the content name itself instead of a destination address. However, one problem that occurs with content oriented networks is the increased memory usage. This is because a huge amount of content exists in the network, and an entry is created in the routing table for each content item. One technique to address this problem is a routing scheme using Bloom filters, which are data structures capable of compressing data. However, this technique cannot cope with content that is moved or deleted. To solve this problem, we propose a method that can cope with moved or deleted content by using two Bloom filters. Simulations we conducted to evaluate the proposed scheme indicated the method was more effective than conventional schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Bloom Filter Parameters for Practical Bloom Filter Based Epidemic Forwarding in DTNs

Epidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in Delay Tolerant Networks. Even if this technique is well known and widely referred, one has to first deal with several practical problems before using it. In particular, in order to manage the redundancy and to avoid useless transmissions, it has been proposed to ask nodes to exchange inform...

متن کامل

Improving Search Efficiency Using Bloom Filter in Partially Connected Ad Hoc Networks

We examine query based (QB) and Bloom filter based (BF) schemes for data retrieval in a partially connected ad hoc network. For the QB scheme, a node retrieves data from another node by querying. Search efficiency deteriorates when the query success probability is small. We propose a Bloom filter based (BF) scheme to improve search efficiency. A data holder summarizes its content by a Bloom fil...

متن کامل

Improving Search Efficiency Using Bloom Filter in Partially Connected Ad Hoc Networks, a Node-centric Analysis

In a partially connected ad hoc network, two nodes communicate and share data when they are in proximity. For the query based (QB) scheme, a node retrieves data from another node by querying. Search efficiency deteriorates when the query success probability is small. We propose a Bloom filter based (BF) scheme to improve search efficiency. A data holder summarizes its content by a Bloom filter ...

متن کامل

Improving search efficiency using Bloom filters in partially connected ad hoc networks: A node-centric analysis

In a partially connected ad hoc network, two nodes communicate and share data when they are in proximity. For the query based (QB) scheme, a node retrieves data from another node by querying. Search efficiency deteriorates when the query success probability is small. We propose a Bloom filter based (BF) scheme to improve search efficiency. A data holder summarizes its content by a Bloom filter ...

متن کامل

Receiver-oriented design of Bloom filters for data-centric routing

Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in network applications. The existing designs of Bloom filters, however, cannot effectively support in-network queries. Given a query for a data it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014